Action + Frame Axioms (often) = Invariants
نویسنده
چکیده
Recent work on the automatic generation of frame axioms from action specifications that have complete fluent change specifications is extended to extract action invariants. An action invariant expresses a property that is preserved by all actions of that class. The extraction is achieved by combining automatically generated frame axioms and the original action axioms relativised to those states in which the action class is enabled, and yield formulas that are action invariants if certain conditions are satisfied. Other combinations similarly relativised are also possible. Action invariants yield system laws or constraints over the state subspaces reachable by the action. Blocks world examples illustrate the general formalism throughout.
منابع مشابه
Persistence , Invariants , and Constraints
Recent work on reasoning about action has shown that there exist interesting connections among frame axioms, action invariants, state constraints and action speciications. In this paper, we address the problem of generating action invariants and generalizing action invariants into state constraints. We rst propose a persistence-based formalism of actions, and show that the generation of action ...
متن کاملSignature submanifolds for some equivalence problems
This article concerned on the study of signature submanifolds for curves under Lie group actions SE(2), SA(2) and for surfaces under SE(3). Signature submanifold is a regular submanifold which its coordinate components are differential invariants of an associated manifold under Lie group action, and therefore signature submanifold is a key for solving equivalence problems.
متن کاملInterpolation Properties of Action Logic: Lazy-Formalization to the Frame Problem
This paper makes a contribution to the meta-theory of reasoning about action. We present two interpolation properties of action logic. We show that the frame axioms which are required for answering a query involve only the objects which are relevant to the query and action description. Moreover, if the action description is expressed by normal form, the required frame axioms depend on only the ...
متن کاملLazy-formalization to the Frame Problem
This paper introduces an inference mechanism for reasoning with incomplete action descriptions by postponing the listing of frame axioms till they are needed. We show that the frame axioms which are required for answering a query involve only the objects which are relevant to the query and action description. Moreover, with certain syntactic restrictions, we need only consisder the frame axioms...
متن کاملFaster Probabilistic Planning through More Efficient Stochastic Satisfiability Problem Encodings
The propositional contingent planner ZANDER solves finitehorizon, partially observable, probabilistic planning problems at state-of-the-art-speeds by converting the planning problem to a stochastic satisfiability (SSAT) problem and solving that problem instead (Majercik 2000). ZANDER obtains these results using a relatively inefficient SSAT encoding of the problem (a linear action encoding with...
متن کامل